On the Deterministic Complexity of Searching Local Maxima

Expected Number of Local Maxima of Some Gaussian Random Polnomials

Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages

In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...

The Impact of the Objective Complexity and Product of Work Task on Interactive Information Searching Behavior

Background and Aim: this study aimed to explore the impact of objective complexity and Product of work task on user's interactive information searching behavior. Method: The research population consisted of MSc students of Ferdowsi university of Mashhad enrolled in 2012-13 academic year. In 3 stages of sampling (random stratified, quota, and voluntary sampling), 30 cases were selected. Each of ...

Comparison of Inventory Models for Optimal Working Capital; Case of Aeronautics Company

The goal of supply chain management is to provide products with best quality, low costs and shortest delay of delivery corresponding to customers’ expectations. To ensure that, companies must be in continuous research for management methodologies which allows them the possibility to improve their financial results by decreasing costs and improving their process and thus customers satisfaction. ...

Solving POMDPs by Searching the Space of Finite Policies

Solving partially observable Markov decision processes (POMDPs) is highly intractable in general, at least in part because the optimal policy may be infinitely large. In this paper, we explore the problem of finding the optimal policy from a restricted set of policies, represented as finite state automata of a given size. This problem is also intractable, but we show that the complexity can be ...